Graph Theoretic Approach to Parallel Gene
نویسندگان
چکیده
7 We study parallel complexity of signed graphs motivated by the highly 8 complex genetic recombination processes in ciliates. The molecular gene 9 assembly operations have been modeled by operations of signed graphs, 10 i.e., graphs where the edges have a sign + or −. In the optimization prob11 lem for signed graphs one wishes to find the parallel complexity by which 12 the graph can be reduced to the empty graph. We relate parallel com13 plexity to matchings in graphs for some natural graph classes, especially 14 bipartite graphs. It is shown, for instance, that a bipartite graph G has 15 parallel complexity one if and only if G has a unique perfect matching. 16 We also formulate some open problems of this research topic. 17
منابع مشابه
A module theoretic approach to zero-divisor graph with respect to (first) dual
Let $M$ be an $R$-module and $0 neq fin M^*={rm Hom}(M,R)$. We associate an undirected graph $gf$ to $M$ in which non-zero elements $x$ and $y$ of $M$ are adjacent provided that $xf(y)=0$ or $yf(x)=0$. Weobserve that over a commutative ring $R$, $gf$ is connected anddiam$(gf)leq 3$. Moreover, if $Gamma (M)$ contains a cycle,then $mbox{gr}(gf)leq 4$. Furthermore if $|gf|geq 1$, then$gf$ is finit...
متن کاملExact annihilating-ideal graph of commutative rings
The rings considered in this article are commutative rings with identity $1neq 0$. The aim of this article is to define and study the exact annihilating-ideal graph of commutative rings. We discuss the interplay between the ring-theoretic properties of a ring and graph-theoretic properties of exact annihilating-ideal graph of the ring.
متن کاملA note on a graph related to the comaximal ideal graph of a commutative ring
The rings considered in this article are commutative with identity which admit at least two maximal ideals. This article is inspired by the work done on the comaximal ideal graph of a commutative ring. Let R be a ring. We associate an undirected graph to R denoted by mathcal{G}(R), whose vertex set is the set of all proper ideals I of R such that Inotsubseteq J(R), where J(R) is...
متن کاملParallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کاملSome results on the complement of a new graph associated to a commutative ring
The rings considered in this article are commutative with identity which are not fields. Let R be a ring. A. Alilou, J. Amjadi and Sheikholeslami introduced and investigated a graph whose vertex set is the set of all nontrivial ideals of R and distinct vertices I, J are joined by an edge in this graph if and only if either ann(I)J = (0) or ann(J)I = (0). They called this graph as a new graph as...
متن کامل